Colored Non-crossing Euclidean Steiner Forest
نویسندگان
چکیده
Given a set of k-colored points in the plane, we consider the problem of finding k trees such that each tree connects all points of one color class, no two trees cross, and the total edge length of the trees is minimized. For k = 1, this is the well-known Euclidean Steiner tree problem. For general k, a kρ-approximation algorithm is known, where ρ ≤ 1.21 is the Steiner ratio. We present a PTAS for k = 2, a (5/3 + ε)-approximation algorithm for k = 3, and two approximation algorithms for general k, with ratios O( √ n log k) and k + ε.
منابع مشابه
On Euclidean Prize-collecting Steiner Forest Problems
In this paper, we consider prize-collecting Steiner forest and k-Steiner forest when the vertices of the input graph are points in the Euclidean plane and the lengths are Euclidean distances. First, we simplify the analysis of the polynomial-time approximation scheme (PTAS) of Borradaile et al. [7, 8] for the Euclidean Steiner forest problem. This is done by proving a new structural property an...
متن کاملThe Euclidean Steiner Tree Problem
The Euclidean Steiner tree problem is solved by finding the tree with minimal Euclidean length spanning a set of fixed vertices in the plane, while allowing for the addition of auxiliary vertices (Steiner vertices). Steiner trees are widely used to design real-world structures like highways and oil pipelines. Unfortunately, the Euclidean Steiner Tree Problem has shown to be NP-Hard, meaning the...
متن کاملHeuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This problem is significant in many practical situations, such as laying cable networks, where the cost for laying a cable can be highly dependent on the location and the nature of the area through which it is to be laid. We empi...
متن کاملOn the History of the Euclidean Steiner Tree Problem
The history of the Euclidean Steiner tree problem, which is the problem of constructing a shortest possible network interconnecting a set of given points in the Euclidean plane, goes back to Gergonne in the early 19th century. We present a detailed account of the mathematical contributions of some of the earliest papers on the Euclidean Steiner tree problem. Furthermore, we link these initial c...
متن کاملProperly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane
Let X be a set of multicolored points in the plane such that no three points are collinear and each color appears on at most ⌈|X|/2⌉ points. We show the existence of a non-crossing properly colored geometric perfect matching on X (if |X| is even), and the existence of a non-crossing properly colored geometric spanning tree with maximum degree at most 3 on X. Moreover, we show the existence of a...
متن کامل